waiting time improvement in human queues by using first-best customer priority rule algorithm

Time Dependent Priority Queues

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

Waiting time characteristics in cyclic queues

In this paper we study a single-server queue with FIFO service and cyclic interarrival and service times. An efficient approximative algorithm is developed for the first two moments of the waiting time. Numerical results are included to demonstrate that the algorithm yields accurate results. For the special case of exponential interarrival times we present a simple exact analysis.

Self-Selecting Priority Queues with Burr Distributed Waiting Costs

Service providers, in the presence of congestion and heterogeneity of customer waiting costs, often introduce a fee-based premier option using which the customers selfsegment themselves. Examples of this practice are found in health care (concierge medicine), amusement parks, government (consular services), and transportation. Using a single-server queuing system with customer waiting costs mod...

Fuzzy Retrial Queues with Priority using DSW Algorithm

Queues with waiting time dependent service

Motivated by service levels in terms of the waiting-time distribution seen, for instance, in call centers, we consider two models for systems with a service discipline that depends on the waiting time. The first model deals with a single server that continuously adapts its service rate based on the waiting time of the first customer in line. In the second model, one queue is served by a primary...

Priority Queues and Dijkstra ’ s Algorithm ∗

We study the impact of using different priority queues in the performance of Dijkstra’s SSSP algorithm. We consider only general priority queues that can handle any type of keys (integer, floating point, etc.); the only exception is that we use as a benchmark the DIMACS Challenge SSSP code [1] which can handle only integer values for distances. Our experiments were focussed on the following: 1....